منابع مشابه
A Cooperative Repair Method for a Distributed Scheduling System
For some time we have been studying the is sues involved in job shop scheduling in an envi ronment of cooperative distributed agents none of which has a complete view of the resources available or of the tasks to be scheduled Sched ules produced cooperatively by such distributed agents using constraint satisfaction methods are often not optimal because of the inherent asyn chronicity of the dis...
متن کاملA Distributed Search and Simulation Method for Job Flow Scheduling
Simulation serves as an effective decision support tool in flexible manufacturing systems for understanding and analyzing the effect of changes to the system environment. Due to the variety of situations that have to be evaluated, a generative scheduler for such a system must be more flexible than its realistic equal while still producing detailed and accurate schedules. This research presents ...
متن کاملA Sampling-based Scheduling Method for Distributed Computing
In this paper, we propose a new solution for dynamic task scheduling in distributed environment. We argue that a function is existed in the items: execution time, the size of data and the algorithm, therefore we can deduce the execution time of a data mining task from the corresponding the size of data and algorithm. We adopt the sampling method for process the tasks scheduling in distributed d...
متن کاملDynamic Scheduling of Distributed Method Invocations
Distributed method invocations require dynamic scheduling algorithms and efficient resource projections to provide timeliness guarantees to application objects. In this paper we present a dynamic scheduling algorithm that examines the computation times, real times and resource requirements of the application tasks to determine a feasible schedule for the method invocations. The schedule is driv...
متن کاملA Mathematical Model and a Solution Method for Hybrid Flow Shop Scheduling
This paper studies the hybrid flow shop scheduling where the optimization criterion is the minimization of total tardiness. First, the problem is formulated as a mixed integer linear programming model. Then, to solve large problem sizes, an artificial immune algorithm hybridized with a simple local search in form of simulated annealing is proposed. Two experiments are carried out to evaluate th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEJ Transactions on Electronics, Information and Systems
سال: 1989
ISSN: 0385-4221,1348-8155
DOI: 10.1541/ieejeiss1987.109.4_291